Multi-Agent Action Graph Based Task Allocation and Path Planning Considering Changes in Environment
نویسندگان
چکیده
Task allocation and path planning considering changes in the mobility of robots environment allows to efficiently execute tasks with smaller travel times. A lunar base construction is one situations which can more accomplish its goal by taking such into account when performing tasks. For construction, we assumed that a robot executes task building road, aisles were unusable before become usable post execution. If are considered advance, plan wait until move executing task. However, previous studies have not changes, resulting inefficient planning. To solve this problem, developed multi-agent action graph consists multiple layers expresses associated execution terms these layers. In graph, formulated as combinatorial optimization problem optimized using mixed-integer programming. Multi-agent graphs proposed formulation enable efficient robots’ advance. Through simulations, confirmed method completed approximately 16.4% earlier than conventional method, while consuming 16.0% less total energy robots.
منابع مشابه
Multi-Agent Path Planning Based on Task-Swap Negotiation
Symbolic path planning in autonomous robotic agents is the search, on a network of places and routes modeling the environment, for a sequence of routes which enables an agent to execute a set of interrelated tasks. When several agents are present in the environment, each having been assigned a set of tasks, the adoption of coordination mechanisms allows the task-execution costs to be decreased....
متن کاملMulti Agent Based Dynamic Task Allocation
Multi-Agent system, which is relatively a recent term, can be viewed as a sub-field of Distributed AI. In order to construct and solve complex real world problems like task allocation in an organization, a number of agents can perform work cooperatively and collaboratively. To achieve the maximum system utility through the proper task allocation among agents, there is a notion of dynamic team f...
متن کاملConstraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon becomes intractable for even a moderate number of robots. Decentralised approaches, such as priority planning, are much faster but lack completeness. Previous work has demonstrated that the search can be significantly ...
متن کاملMulti Agent Path Planning Approach to Dynamic Free Flight Environment
For years the air traffic routes have been fixed by the air traffic controllers on the basis of pre-acquired knowledge. Free flight air traffic management is a solution to move the decision making process for route choices from air traffic controllers to the cockpit. The basic idea is optimize the flight routes in the consideration of multiple objectives .i.e. the optimal path is decided based ...
متن کاملEfficient Multi-Agent Path Planning
Animating goal-driven agents in an environment with obstacles is a time consuming process, particularly when the number of agents is large. In this paper, we introduce an efficient algorithm that creates path plans for objects that move between user defined goal points and avoids collisions. In addition, the system allows “culling” of some of the computation for invisible agents: agents are acc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3249757